Tony Tan

Results: 61



#Item
11FOR IMMEDIATE RELEASE MEDIA RELEASE President Tony Tan interacts with President’s Young Talents artist Ryf Zaini’s artwork ‘Unveil the curtain to the window with no ledge’ while the artist (right)explains the wor

FOR IMMEDIATE RELEASE MEDIA RELEASE President Tony Tan interacts with President’s Young Talents artist Ryf Zaini’s artwork ‘Unveil the curtain to the window with no ledge’ while the artist (right)explains the wor

Add to Reading List

Source URL: www.singaporeartmuseum.sg

Language: English - Date: 2013-12-05 09:47:30
12On the Satisfiability of Two-Variable Logic over Data Words Claire David, Leonid Libkin, and Tony Tan School of Informatics, University of Edinburgh Abstract. Data trees and data words have been studied extensively

On the Satisfiability of Two-Variable Logic over Data Words Claire David, Leonid Libkin, and Tony Tan School of Informatics, University of Edinburgh Abstract. Data trees and data words have been studied extensively

Add to Reading List

Source URL: alpha.uhasselt.be

Language: English - Date: 2013-09-27 07:35:34
131 Graph Reachability and Pebble Automata over Infinite Alphabets Tony Tan Hasselt University and Transnational University of Limburg Let D denote an infinite alphabet – a set that consists of infinitely many symbols.

1 Graph Reachability and Pebble Automata over Infinite Alphabets Tony Tan Hasselt University and Transnational University of Limburg Let D denote an infinite alphabet – a set that consists of infinitely many symbols.

Add to Reading List

Source URL: alpha.uhasselt.be

Language: English - Date: 2013-09-27 07:35:34
    14On the variable hierarchy of first-order spectra Eryk Kopczy´ nski∗ Tony Tan†

    On the variable hierarchy of first-order spectra Eryk Kopczy´ nski∗ Tony Tan†

    Add to Reading List

    Source URL: alpha.uhasselt.be

    - Date: 2014-07-02 11:00:34
      15A Formalism for Graph Databases and its Model of Computation Juan Reutter and Tony Tan University of Edinburgh Abstract. Graph databases are directed graphs in which the edges are labeled with symbols from a finite alpha

      A Formalism for Graph Databases and its Model of Computation Juan Reutter and Tony Tan University of Edinburgh Abstract. Graph databases are directed graphs in which the edges are labeled with symbols from a finite alpha

      Add to Reading List

      Source URL: alpha.uhasselt.be

      - Date: 2013-09-27 07:35:34
        16Graph Reachability and Pebble Automata over Infinite Alphabets Tony Tan Department of Computer Science Technion – Israel Institute of Technology Haifa 32000, Israel Email:

        Graph Reachability and Pebble Automata over Infinite Alphabets Tony Tan Department of Computer Science Technion – Israel Institute of Technology Haifa 32000, Israel Email:

        Add to Reading List

        Source URL: alpha.uhasselt.be

        Language: English - Date: 2013-09-27 07:35:34
          171 Efficient Reasoning about Data Trees via Integer Linear Programming CLAIRE DAVID, Universit´e Paris-Est LEONID LIBKIN, University of Edinburgh TONY TAN, University of Edinburgh

          1 Efficient Reasoning about Data Trees via Integer Linear Programming CLAIRE DAVID, Universit´e Paris-Est LEONID LIBKIN, University of Edinburgh TONY TAN, University of Edinburgh

          Add to Reading List

          Source URL: alpha.uhasselt.be

          Language: English - Date: 2013-09-27 07:35:34
            18A note on two-pebble automata over infinite alphabets Michael Kaminski Tony Tan Department of Computer Science Technion – Israel Institute of Technology Haifa 32000

            A note on two-pebble automata over infinite alphabets Michael Kaminski Tony Tan Department of Computer Science Technion – Israel Institute of Technology Haifa 32000

            Add to Reading List

            Source URL: alpha.uhasselt.be

            Language: English - Date: 2013-09-27 07:35:34
              191 Extending two-variable logic on data trees with order on data values and its automata Tony Tan Hasselt University and Transnational University of Limburg

              1 Extending two-variable logic on data trees with order on data values and its automata Tony Tan Hasselt University and Transnational University of Limburg

              Add to Reading List

              Source URL: alpha.uhasselt.be

              Language: English - Date: 2013-09-27 07:50:37
                20A Formalism for Graph Databases and its Model of Computation Juan Reutter and Tony Tan University of Edinburgh Abstract. Graph databases are directed graphs in which the edges are labeled with symbols from a finite alpha

                A Formalism for Graph Databases and its Model of Computation Juan Reutter and Tony Tan University of Edinburgh Abstract. Graph databases are directed graphs in which the edges are labeled with symbols from a finite alpha

                Add to Reading List

                Source URL: web.ing.puc.cl

                Language: English - Date: 2013-12-24 11:08:55